Ordinary graphs and subplane partitions
نویسندگان
چکیده
منابع مشابه
Ordinary graphs and subplane partitions
We introduce a generalization of symmetric (v, k, λ) block designs, and show how these could potentially be used to construct projective planes of non-prime-power order. If q is a prime power and n2+n+1 = N(q2+q+1), then conceivably we could construct a projective plane of order n by gluing together N planes of order q. For example, 182+18+1 = 343 = 49 ·7. Can we make a projective plane of orde...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملGraphs, Ags and Partitions
This paper deenes, for each graph G, a ag vector fG. The ag vectors of the graphs on n vertices span a space whose dimension is p(n), the number of partitions on n. The analogy with convex polytopes indicates that the linear inequalities satissed by fG may be both interesting and accessible. Such would provide inequalities both sharp and subtle on the combinatorial structure of G. These may be ...
متن کاملGraphs, flags and partitions
This paper defines, for each graph G, a flag vector fG. The flag vectors of the graphs on n vertices span a space whose dimension is p(n), the number of partitions on n. The analogy with convex polytopes indicates that the linear inequalities satisfied by fG may be both interesting and accessible. Such would provide inequalities both sharp and subtle on the combinatorial structure of G. These m...
متن کاملGraphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.09.014